Generating custom propagators for arbitrary constraints
نویسندگان
چکیده
Article history: Received 29 November 2012 Received in revised form 27 February 2014 Accepted 2 March 2014 Available online 12 March 2014
منابع مشابه
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation that would be performed on every reachable subdomain of scope(c). Our propagators are stateless: they store no state between calls, and so incur no overhead in storing and backtracking state during search. The preproces...
متن کاملGenerating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarative specification is automatically translated into an efficient propagator. This paper introduces the use of existential monadic secondorder logic as declarative specification language for finite set propagators. The ap...
متن کاملConstraints, lazy constraints, or propagators in ASP solving: An empirical analysis
Answer Set Programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications this approach is infeasible because the grounding of one or few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the i...
متن کامل7 References 5.3 Layout Synthesis for Different Design Styles
We present a general multi-layer area router for performing detailed routing in integrated circuits.This router is based on a novel grid construction scheme which considers the differing design rules of therouting layers and produces more wiring tracks than a uniform grid scheme. Our router is very general andflexible and is designed to handle all the physical constraints of a C...
متن کاملHalf Reification and Flattening
Usually propagation-based constraint solvers construct a constraint network as a conjunction of constraints. They provide propagators for each form of constraint c. In order to increase expressiveness, systems also usually provide propagators for reified forms of constraints. A reified constraint b ↔ c associates a truth value b with a constraint c. With reified propagators, systems can express...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 211 شماره
صفحات -
تاریخ انتشار 2014